A cyclic monotonically normal space which is not $K\sb 0$
نویسندگان
چکیده
منابع مشابه
A SEPARABLE NORMAL TOPOLOGICAL GROUP WHICH IS NOT LINDELijF
In 1968 Wilansky asked whether a separable normal topological group must be Lindelof. In [7] this question was answered in the negative, assuming CH, by constructing a hereditarily separable, normal group which is not Lindeliif. We give an example of a separable normal group which contains a closed subspace homeomorphic to an uncountable regular cardinal, in ZFC only. Of course we have to sacri...
متن کاملKat Etov's Lemma and Monotonically Normal Spaces
An interpolation lemma due to Kat etov is simpliied in order to make it more general and easier to use. Several results are established to illustrate applications of this lemma, including a characterization of monotonically normal spaces and a topology-free insertion theorem. We also prove that a topological space has an order-preserving insertion if and only if it is dominated by a collection ...
متن کاملMenger probabilistic normed space is a category topological vector space
In this paper, we formalize the Menger probabilistic normed space as a category in which its objects are the Menger probabilistic normed spaces and its morphisms are fuzzy continuous operators. Then, we show that the category of probabilistic normed spaces is isomorphicly a subcategory of the category of topological vector spaces. So, we can easily apply the results of topological vector spaces...
متن کاملOrder-like structure of monotonically normal spaces
For a compact monotonically normal space X we prove: (1) X has a dense set of points with a well-ordered neighborhood base (and so X is co-absolute with a compact orderable space); (2) each point of X has a well-ordered neighborhood πbase (answering a question of Arhangel’skii); (3) X is hereditarily paracompact iff X has countable tightness. In the process we introduce weak-tightness, a notion...
متن کاملA convex polyhedron which is not equifacettable
A famous theorem due to E. Steinitz states, in one of its formulations, that every planar (or, equivalently, every spherical) graph can be realized as the graph of edges and vertices of a convex polyhedron in Euclidean 3-space (see, for example, Grünbaum [1, Section 13.1] or Ziegler [3, Chapter 4]). This representation is possible in many different ways, but in all of them the circuits that bou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1993
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1993-1185281-8